The Pointwise Stationary Approximation for Queues with Nonstationary Arrivals*

نویسندگان

  • LINDA GREEN
  • PETER KOLESAR
چکیده

We empirically explore the, accuracy of an easily computed approximation for long run, average performance measures such as expected delay and probability of delay in multiserver queueing systems with exponential service times and periodic (sinusoidal) Poisson arrival processes. The pointwise stationary approximation is computed by integrating over time (that is taking the expectation of) the formula for the stationary performance measure with the arrival rate that applies at each point in time. This approximation, which has been empirically confirmed as a tight upper bound of the true value, is shown to be very accurate for a range of parameter values corresponding to a reasonably broad spectrum of real systems. (QUEUES; NONSTATIONARITY; APPROXIMATION)

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Simple Approximation for Modeling Nonstationary Queues

Evaluation of the behavior of queues with nonsta-tionary arrival processes is of importance in several applications including communication networks. However , the analysis of nonstationary queues is in general computationally complex, and seldom produces closed form expressions. Thus approximation methods may be more appropriate. In this paper, the pointwise stationary uid ow approximation (PS...

متن کامل

The Dynamic Analysis and Design of A Communication link with Stationary and Nonstationary Arrivals

Most research in queueing theory is typically based on the steady-state analysis. In today’s dynamically changing traffic environment, the steady-state analysis may not provide enough information to operators regarding Quality of Service (QoS) requirements and dynamic design. In addition, the steady state analysis is not practical for nonstationary arrivals. In this paper, we consider the time-...

متن کامل

The Lagged PSA for Estimating Peak Congestion in Multiserver Markovian Queues with Periodic Arrival Rates

W A 7 e propose using a modification of the simple peak hour approximation (SPHA) for estimating peak congestion in multiserver queueing systems with exponential service times and time-varying periodic Poisson arrivals. This lagged pointwise stationary approximation (lagged PSA) is obtained by first estimating the time of the actual peak congestion by the time of peak congestion in an infinite ...

متن کامل

Unstable Asymptomatics for Nonstationary Queues

We relate laws of large numbers and central limit theorems for nonstationary counting processes to corresponding limits for their inverse processes. We apply these results to develop approximations for queues that are unstable in a nonstationary manner. We obtain unstable nonstationary analogs of the queueing relation L = λW and associated central-limit-theorem versions. For modeling and to obt...

متن کامل

Poisson and Gaussian Approximations for Multi-Server Queues with Batch Arrivals and Batch Abandonment

In this paper, we consider nonstationary multi-server queues and multiserver loss queues with batch arrivals and where we allow customer abandonment to also occur as a Markovian batch process. To estimate the performance of the system, we develop two new approximations that take advantage of the functional Kolmogorov forward equations. The first approximation we develop uses the Poisson distrib...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007